Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
نویسندگان
چکیده
منابع مشابه
Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملAutomated norm synthesis in planning environments
Multiagent systems offer a design paradigm used to conceptualise and implement systems composed of autonomous agents. Autonomy facilitates proactive independent behaviour yet in practice agents are constrained in order to ensure the system satisfies a desired social objective. Explicit constraints on agent behaviour, in the form of social norms, encourage this desirable system behaviour, yet re...
متن کاملDistributed semantic search for the web: a multiagent approach
Cite as: O " " ? B ! ! m " ' Proc. of 9th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2010) # $ $ % $ " & ! ' ()*(+ ,)() . / & / ' © ,)() ! "' 000& & & & g !N (& The search interest “Comedy Videos that contain a muscular guy who is chased by a small dog” can be represented as Comedy Video ∃ contain.(Small Dog ∃ chase.(Muscular Man)). On the other hand, the search interest “Com...
متن کاملNetworked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs
In many real-world multiagent applications such as distributed sensor nets, a network of agents is formed based on each agent’s limited interactions with a small number of neighbors. While distributed POMDPs capture the realworld uncertainty in multiagent domains, they fail to exploit such locality of interaction. Distributed constraint optimization (DCOP) captures the locality of interaction b...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002